Elementary Matrix Decomposition Algorithm for Symmetric Extension of Laurent Polynomial Matrices and its Application in Construction of Symmetric M-band Filter Banks
نویسنده
چکیده
In this paper, we develop a novel and effective algorithm for the construction of perfect reconstruction filter banks (PRFBs) with linear phase. In the algorithm, the key step is the symmetric Laurent polynomial matrix extension (SLPME). There are two typical problems in the construction: (1) For a given symmetric finite low-pass filter a with the polyphase, to construct a PRFBs with linear phase such that its low-pass band of the analysis filter bank is a. (2) For a given dual pair of symmetric finite low-pass filters, to construct a PRFBs with linear phase such that its low-pass band of the analysis filter bank is a, while its low-pass band of the synthesis filter bank is b. In the paper, we first formulate the problems by the SLPME of the Laurent polynomial vector(s) associated to the given filter(s). Then we develop a symmetric elementary matrix decomposition algorithm based on Euclidean division in the ring of Laurent polynomials, which finally induces our SLPME algorithm.
منابع مشابه
Euclidean Algorithm for Extension of Symmetric Laurent Polynomial Matrix and Its Application in Construction of Multiband Symmetric Perfect Reconstruction Filter Bank
For a given pair of s-dimensional real Laurent polynomials (~a(z),~b(z)), which has a certain type of symmetry and satisfies the dual condition~b(z) T ~a(z) = 1, an s× s Laurent polynomial matrix A(z) (together with its inverse A−1(z)) is called a symmetric Laurent polynomial matrix extension of the dual pair (~a(z),~b(z)) if A(z) has similar symmetry, the inverse A−1(Z) also is a Laurent polyn...
متن کاملSplitting a Matrix of Laurent Polynomials with Symmetry and itsApplication to Symmetric Framelet Filter Banks
Let M be a 2 × 2 matrix of Laurent polynomials with real coefficients and symmetry. In this paper, we obtain a necessary and sufficient condition for the existence of four Laurent polynomials (or FIR filters) u1, u2, v1, v2 with real coefficients and symmetry such that [ u1(z) v1(z) u2(z) v2(z) ] [ u1(1/z) u2(1/z) v1(1/z) v2(1/z) ] = M(z) ∀ z ∈ C\{0} and [Su1](z)[Sv2](z) = [Su2](z)[Sv1](z), whe...
متن کاملMatrix Splitting with Symmetry and Symmetric Tight Framelet Filter Banks with Two High-pass Filters
The oblique extension principle introduced in [3, 5] is a general procedure to construct tight wavelet frames and their associated filter banks. Symmetric tight framelet filter banks with two high-pass filters have been studied in [13, 16, 17]. Tight framelet filter banks with or without symmetry have been constructed in [1]–[21] and references therein. This paper is largely motivated by severa...
متن کاملMatrix Extension with Symmetry and Its Application to Filter Banks
Let P be an r×smatrix of Laurent polynomials with symmetry such that P(z)P∗(z) = Ir for all z ∈ C\{0} and the symmetry of P is compatible. The matrix extension problem with symmetry is to find an s × s square matrix Pe of Laurent polynomials with symmetry such that [Ir,0]Pe = P (that is, the submatrix of the first r rows of Pe is the given matrix P), Pe is paraunitary satisfying Pe(z)Pe(z) = Is...
متن کاملOn the group-theoretic structure of lifted filter banks
The polyphase-with-advance matrix representations of whole-sample symmetric (WS) unimodular filter banks form a multiplicative matrix Laurent polynomial group. Elements of this group can always be factored into lifting matrices with half-sample symmetric (HS) off-diagonal lifting filters; such linear phase lifting factorizations are specified in the ISO/IEC JPEG 2000 image coding standard. Half...
متن کامل